An algorithm for optimal partitioning of a graph

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An exact algorithm for graph partitioning

An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine underestimate. It is shown that the best affin...

متن کامل

An Efficient MATLAB Algorithm for Graph Partitioning

This report describes a graph partitioning algorithm based on spectral factorization that can be implemented very efficiently with just a hand full of MATLAB commands. The algorithm is closely related to the one proposed by Phillips and Kokotović [3] for state-aggregation in Markov chains. The appendix contains a MATLAB script that implements the algorithm. 1 Graph partitioning Consider an undi...

متن کامل

A Multiagent Algorithm for Graph Partitioning

The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we present a new simple multiagent algorithm, ants, and we test its performance with standard graph bench...

متن کامل

Isoperimetric Partitioning: A New Algorithm for Graph Partitioning

We present a new algorithm for graph partitioning based on optimization of the combinatorial isoperimetric constant. It is shown empirically that this algorithm is competitive with other global partitioning algorithms in terms of partition quality. The isoperimetric algorithm is easy to parallelize, does not require coordinate information and handles nonplanar graphs, weighted graphs and famili...

متن کامل

An Algorithm for Optimal Partitioning of Data on an Interval

Manuscript received XXX, 2003. This work was supported by the NASA Applied Information Systems Research Program, the Woodward Fund of San Jose State University, and the NASA Faculty Fellowship Program at Ames Research Center and Dryden Flight Research Center. B. Jackson is with the Department of Mathematics, San Jose State University, J. Scargle is with the Space Science Division, NASA Ames Res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applicationes Mathematicae

سال: 1977

ISSN: 1233-7234,1730-6280

DOI: 10.4064/am-16-1-63-71